A Gentzen-style sequent calculus of constructions with expansion rules
نویسنده
چکیده
A Gentzen-style L-formulation of the calculus of constructions is presented and proved equivalent to a natural deduction formulation based on that of [6]. The L-rules corresponding to the conversion rules of the natural deduction system are expansion rules. Cut elimination follows from the equivalence to the natural deduction formulation and the normalization theorem for the latter.
منابع مشابه
Cut - Free Sequent Calculus For
We aim at an exposition of some nonstandard cut-free Gentzen formalization for S5, called DSC (double sequent calculus). DSC operates on two types of sequents instead of one, and shifting of wffs from one side of sequent to another is regulated by special rules and subject to some restrictions. Despite of this apparent inconvenience it seems to be simpler than other, known Gentzen-style systems...
متن کاملSeparable Sequent Calculus for First-order Classical Logic (Work in Progress)
This paper presents Separable Sequent Calculus as an extension of Gentzen’s first-order classical sequent calculus with Herband-style structural rules (subformula contraction and weakening). Every proof can be transformed into separated form, in which all logical rules precede all structural rules, a result in the spirit of Gentzen’s midsequent theorem or sharpened Hauptsatz (where all proposit...
متن کاملCurry-Howard Term Calculi for Gentzen-Style Classical Logics
This thesis is concerned with the extension of the Curry-Howard Correspondence to classical logic. Although much progress has been made in this area since the seminal paper by Griffin, we believe that the question of finding canonical calculi corresponding to classical logics has not yet been resolved. We examine computational interpretations of classical logics which we keep as close as possib...
متن کاملA Sequent-Based Representation of Logical Argumentation
In this paper we propose a new presentation of logic-based argumentation theory through Gentzen-style sequent calculi. We show that arguments may be represented by Gentzen-type sequents and that attacks between arguments may be represented by sequent elimination rules. This framework is logic-independent, i.e., it may be based on arbitrary languages and consequence relations. Moreover, the usua...
متن کاملDynamic Derivations for Sequent-Based Logical Argumentation
We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks (conflicts) between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems. This framework accommodates different languages and logics in which arguments may be represented...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 243 شماره
صفحات -
تاریخ انتشار 2000